Programming Questions for Practice
Given an integer, if the number is prime, return 1. Otherwise return its smallest divisor greater than 1. Use the function isPrime().
#include <stdio.h>
#include <stdlib.h>
/*
Given an integer, if the number is prime, return 1.
Otherwise return its smallest divisor greater than 1.
Use the function isPrime().
*/
int isPrime(int number) {
int i;
for(i = 2; i < number; i++) {
if(number % i == 0) {
return i;
}
}
return 1;
}
int main()
{
int number;
printf("Enter any integer: ");
scanf("%d", &number);
printf("Result = %d\n", isPrime(number));
return 0;
}
Code not available...
Code not available...